//
// Created by Jisam on 23/08/2024 7:42 PM.
// Solution of  又是一年毕业季
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include<climits>

using namespace std;

#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>

#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
using namespace std;
using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};

void solution() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto & x : a) cin >> x;
    int gc = 1;
    for(auto & x : a ){
        gc = __gcd(x,gc);
    }
    cout << gc;
//     for(int i = 2; i <= 1e18; i ++){
// //         cout << "i : " << i ;
//         int cnt = 0;
//         for(auto &x : a){
//             if( i % x != 0){
//                 cnt ++;
// //                 cout << x  % i << " ";
//             }else{
//                 cnt = 0;
//                 break;
//             }
//         }
//         if(cnt == n){
//             cout << i << endl;
//             return;
//         }

//     }


}

int main() {
    code_by_jisam;
    int T = 1;
    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}